Verification of LINE Encryption Version 1.0 Using ProVerif

Protocol verification with Proverif

automatic verification of authentication protocols using genetic programming

implicit and unobserved errors and vulnerabilities issues usually arise in cryptographic protocols and especially in authentication protocols. this may enable an attacker to make serious damages to the desired system, such as having the access to or changing secret documents, interfering in bank transactions, having access to users’ accounts, or may be having the control all over the syste...

Verification of STAR-Vote and Evaluation of FDR and ProVerif

We present the first automated privacy analysis of STARVote, a real world voting system design with sophisticated “end-to-end” cryptography, using FDR and ProVerif. We also evaluate the effectiveness of these tools. Despite the complexity of the voting system, we were able to verify that our abstracted formal model of STAR-Vote provides ballot-secrecy using both formal approaches. Notably, ProV...

Formal Verification of Improved Numeric Comparison Protocol for Secure Simple Paring in Bluetooth Using ProVerif

Recently, research has been conducted on automatic verification of cryptographic security protocols with the formal method. An automatic verifier is very useful because the risk of human error in such complicated protocols can be reduced. In this paper, we introduce our formalization of an improved Numeric Comparison protocol for Secure Simple Pairing in Bluetooth proposed by Yeh et al. and ver...

Formal Verification of ElGamal Encryption using a Probabilistic Lambda-Calculus

Game-based proofs are a common technique used to verify cryptographic constructions. Such proofs consist of a sequence of games where each transition from one game to the next can be individually verified. However, as more and more increasingly complex proofs are being published, even such transitions are often non-trivial. Moreover, games are frequently described informally or just in some ad-...